The Dynamics of a Genetic Algorithm for Simple Random Ising Systems
نویسنده
چکیده
A formalism is presented for analysing Genetic Algorithms. It is used to study a simple Genetic Algorithm consisting of selection, mutation and crossover which is searching for the ground states of simple random Ising-spin systems: a random-eld ideal paramagnet and a spin-glass chain. The formalism can also be applied to other population based search techniques and to biological models of micro-evolution. To make the problem tractable, it is assumed that the population dynamics can be described by a few macroscopic order parameters and that the remaining microscopic degrees of freedom can be averaged out. The macroscopic quantities that are used are the cumulants of the distribution of tnesses (or energies) in the population. A statistical mechanics model is presented which describes the population conngura-tion in terms of the cumulants, this is used to derive equations of motion for the cumulants. Predictions of the theory are compared with experiments and are shown to predict the average time to convergence and the average tness of the nal population accurately. A simpliied version of the equations is produced by keeping only leading nonlinear terms, and truncating the cumulant expansion. This is shown to give a novel description of the role of genetic operators in search, e.g. it is argued that an important role of crossover is to reduce the skewness of the population.
منابع مشابه
Magnetic Properties and Phase Transitions in a Spin-1 Random Transverse Ising Model on Simple Cubic Lattice
Within the effective-field theory with correlations (EFT), a transverse random field spin-1 Ising model on the simple cubic (z=6) lattice is studied. The phase diagrams, the behavior of critical points, transverse magnetization, internal energy, magnetic specific heat are obtained numerically and discussed for different values of p the concentration of the random transverse field.
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Algorithm for Task Scheduling on Heterogeneous Computing Systems Based on TRIZ
An efficient assignment and scheduling of tasks is one of the key elements in effective utilization of heterogeneous multiprocessor systems. The task scheduling problem has been proven to be NP-hard is the reason why we used meta-heuristic methods for finding a suboptimal schedule. In this paper we proposed a new approach using TRIZ (specially 40 inventive principles). The basic idea of thi...
متن کاملAn Efficient Genetic Agorithm for Solving the Multi-Mode Resource-Constrained Project Scheduling Problem Based on Random Key Representation
In this paper, a new genetic algorithm (GA) is presented for solving the multi-mode resource-constrained project scheduling problem (MRCPSP) with minimization of project makespan as the objective subject to resource and precedence constraints. A random key and the related mode list (ML) representation scheme are used as encoding schemes and the multi-mode serial schedule generation scheme (MSSG...
متن کامل